Verification of Concurrent Programs: The Automata-Theoretic Framework

We present an automata-theoretic framework to the veriication of concurrent and nondeterministic programs. The basic idea is that to verify that a program P is correct one writes a program A that receives the computation of P as input and diverges only on incorrect computations of P. Now P is correct if and only if a program P A , obtained by combining P and A, terminates. We formalize this idea in a framework of !-automata with a recursive set of states. This uniies previous works on veriication of fair termination and veriication of temporal properties.